#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define SWAP(a,b){int tmp=a;a=b;b=tmp;}//带参数的宏
//宏替换，比函数的效率要高，避免重复代码
#define  N 10
#define MAX 100
#define SIZE 10
void bubblesort(int* a);//*a<==>a[]
void selectsort(int* a);
void insertsort(int* a);
void shellsort(int* a);
void quicksort(int* a,int m,int n);
void shellSort2(int* arr);
void insertSort2(int* arr);
int divide(int* arr, int beg, int end);
void quickSort2(int* arr, int beg, int end);
void adjustMaxheap(int* arr, int pos, int size);
void heapsort(int* arr, int size);
void mergesort(int* arr, int low, int high);
void countsort(int* a);
